The characterisation of the smallest two fold blocking sets in PG(n, 2)
نویسندگان
چکیده
We classify the smallest two fold blocking sets with respect to the (n−k)-spaces in PG(n, 2). We show that they either consist of two disjoint k-dimensional subspaces or are equal to a (k+1)-dimensional space minus one point.
منابع مشابه
The use of blocking sets in Galois geometries and in related research areas
Blocking sets play a central role in Galois geometries. Besides their intrinsic geometrical importance, the importance of blocking sets also arises from the use of blocking sets for the solution of many other geometrical problems, and problems in related research areas. This article focusses on these applications to motivate researchers to investigate blocking sets, and to motivate researchers ...
متن کاملOn multiple blocking sets in Galois planes
This article continues the study of multiple blocking sets in PG(2, q). In [3], using lacunary polynomials, it was proven that t-fold blocking sets of PG(2, q), q square, t < q1/4/2, of size smaller than t(q + 1) + cqq 2/3, with cq = 2 −1/3 when q is a power of 2 or 3 and cq = 1 otherwise, contain the union of t pairwise disjoint Baer subplanes when t ≥ 2, or a line or a Baer subplane when t = ...
متن کاملThe two smallest minimal blocking sets of Q ( 2 n , 3 ) , n > 3
We describe the two smallest minimal blocking sets of Q(2n, 3), n > 3. To obtain these results, we use the characterization of the smallest minimal blocking sets of Q(6, 3), different from an ovoid. We also present some geometrical properties of ovoids of Q(6, q), q odd.
متن کاملCharacterization results on small blocking sets
In [8], De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q+(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 3, of size at most 3n + 3n−2. This means that the three smallest minim...
متن کاملOn the Smallest Minimal Blocking Sets in Projective Space Generating the Whole Space
It was conjectured that the smallest minimal point sets of PG(2s, q), q a square, that meet every s-subspace and that generate the whole space are Baer subgeometries PG(2s, √ q). This was shown in 1971 by Bruen for s = 1, and by Metsch and Storme [5] for s = 2. Our main interest in this paper is to prepare a possible proof of this conjecture by proving a strong theorem on line-blocking sets in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 63 شماره
صفحات -
تاریخ انتشار 2012